//]]>
Item type | Location | Call Number | Status | Notes | Date Due |
---|---|---|---|---|---|
Book | AUM Main Library | 519.72 B39 (Browse Shelf) | Available | JBC/2012/6152 |
Includes bibliographical references and index.
Linear algebra, convex analysis, and polyhedral sets -- The simplex method -- Starting solution and convergence -- Special simplex implementations and optimality conditions -- Duality and sensitivity analysis -- The decomposition principle -- Complexity of the simplex algorithm and polynomial-time algorithms -- Minimal-cost network flows -- The transportation and assignment problems -- The out-of-kilter algorithm -- Maximal flow, shortest path, multicommodity flow, and network synthesis problems.
There are no comments for this item.